A Novel Transformation Approach of Shared-Link Coded Caching Schemes for Multiaccess Networks

This paper considers the multiaccess coded caching systems formulated by Hachem et al. , including a central server containing $N$ files connected to notation="LaTeX">$K$ cache-less users through an error-free shared link, and cache-nodes, each equipped with cache memory size of notation="LaTeX">$M$ files. Each user has access notation="LaTeX">$L$ neighbouring cache-nodes cyclic wrap-around topology. The scheme proposed suffers from case that does not divide where needed number transmissions (a.k.a. load) is at most four times load expression for divides . Our main contribution propose novel xmlns:xlink="http://www.w3.org/1999/xlink">transformation approach smartly extend schemes satisfying some conditions well known shared-link systems. Then we can get many different subpacketizations system. These resulting have maximum local gain (i.e., cached contents stored any are such retrieval packets maximal) same as original schemes. Applying transformation well-known Maddah-Ali Niesen, obtain new achieves but system parameters. Under constraint placement used in this scheme, our delivery strategy approximately optimal when sufficiently large. Finally, also show transmission be further reduced compressing multicast message.